Geometric vertex decompositions
نویسنده
چکیده
We relate vertex decompositions of simplicial complexes to Gröbner degeneration, in stages, of affine varieties. v cone on the link deletion
منابع مشابه
Gröbner Geometry of Vertex Decompositions and of Flagged Tableaux
We relate a classic algebro-geometric degeneration technique, dating at least to [Hodge 1941], to the notion of vertex decompositions of simplicial complexes. The good case is when the degeneration is reduced, and we call this a geometric vertex decomposition. Our main example in this paper is the family of vexillary matrix Schubert varieties, whose ideals are also known as (one-sided) ladder d...
متن کاملOn the Construction of Regular Polygons and Generalized Napoleon Vertices
An algebraic foundation for the derivation of geometric construction schemes transforming arbitrary polygons with n vertices into k-regular n-gons is given. It is based on circulant polygon transformations and the associated eigenpolygon decompositions leading to the definition of generalized Napoleon vertices. Geometric construction schemes are derived exemplarily for different choices of n an...
متن کاملOn cycle decompositions with a sharply vertex transitive automorphism group
In some recent papers the method of partial differences introduced by the author in [4] was very helpful in the construction of cyclic cycle systems. Here we use and describe in all details this method for the more general purpose of constructing cycle decompositions with a sharply vertex transitive automorphism group not necessarily cyclic.
متن کاملFair Factorizations of the Complete Multipartite Graph and Related Edge-Colorings by
In this dissertation, first the technique of vertex amalgamations is used to extend known results on graph decompositions, and in particular on decompositions of the complete multipartite graph K(n, p) with p parts, each of which has n vertices. The decompositions focus on hamilton cycles and 1-factors that satisfy certain fairness notions, as well as frame versions of these results where each ...
متن کاملDoilies with Vertex Sets 275, 286,... 462
In this paper we close the gap between the results of [8] and [9] by showing that there are 11-doilies for vertex sets of size 275; 286; : : : ; 462: In [8] it is shown that there are 11-doilies with vertex size 462; 473; : : : ; 1001; and in [9] it is shown that there are such diagrams with vertex size 231; 242; : : : ; 352: This is the third paper in a series showing that 11-doilies exist for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004